A Semantic Algebra for Binding Constructs

Semantic Constructions for Hidden Algebra

Hidden algebra is a behavioural algebraic specification formalism for objects. It captures their constructional aspect, concerned with the initialisation and evolution of their states, as well as their observational aspect, concerned with the observable b ehaviour of such states. When attention is restricted to the observational aspect, final/cofree constructions provide suitable denotations fo...

A Unification-Based Semantic Interpretation for Coordinate Constructs

This paper shows that a first-order unificationbased semantic interpretation for various coordinate constructs is possible without an explicit use of lambda expressions if we slightly modify the standard Montagovian semantics of coordination. This modification, along with partial execution, completely eliminates the lambda reduction steps during semantic interpretation. 1 I n t r o d u c t i o ...

A Bound for the Nilpotency Class of a Lie Algebra

In the present paper, we prove that if L is a nilpotent Lie algebra whose proper subalge- bras are all nilpotent of class at most n, then the class of L is at most bnd=(d 1)c, where b c denotes the integral part and d is the minimal number of generators of L.

A Semantic Algebra for Modularized Description Logics Knowledge Bases

Process Algebra for Agent Communication: A General Semantic Approach

In this paper, we consider the process algebra ACPL, which models the basics of agent communication. This algebra combines the informationprocessing aspects of Concurrent Constraint Programming (CCP) with a generalisation of the synchronous handshaking communication mechanism of Communicating Sequential Processes (CSP). The operational semantics of ACPL is given in terms of a transition system ...